Energy, Time, and Space Complexity Analysis of ALU Designs’ Spanning from 2000 to the Present

نویسنده

  • Brittney Fry
چکیده

This paper looks into various metrics discussed in the designs of multiple different ALUs, such as the Clock gated ALU, the ALU utilizing Vedic Multiplier in its MAC unit, and the scalable DCT architecture ALU. The discussion of these designs and the subsequent metrics that will be analyzed will cover both time and space complexity, as well as the general desire for every new design to use less power as the design previous. The metrics that will be discussed throughout this literature will be power consumption, datapath/operand size, ITRS Technology node width, execution time, as well as clock rate. Looking into the trends of these metrics across time may give engineers insight into the future of ALU designs. Keywords— Clock rate, Energy Consumption, Power Dissipation, Data Bus Width, ALU (Arithmetic Logic Unit, CPU (Central Processing Unit), ITRS technology node, Execution Time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Architecture Processors Focusing on ALU and Floating Point Unit Designs

This paper is to evaluate and compare some of the fundamental metrics for selected ALU designs, covering both time and space complexity. The references examined consists of papers from 1999 to present. A total of ten different designs on ALU and Floating points are examined and compared. Some of the key components evaluated are clock rate, memory capacity, components, floating point, ALU, FPGA,...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

On the Design of Fast , Easily Testable ALU

A design methodology for implementing fast, easily testable arithmetic-logic units (ALU’s) is presented. Here, we describe a set of fast adder designs, which are testable with a test set that has either ( ) complexity (Lin-testable) or (1) complexity (C-testable), where is the input operand size of the ALU. The various levels of testability are achieved by exploiting some inherent properties of...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

Adder/Multiplier Design and Metric Evaluation

Many Arithmic Logic Unit (ALU) designs have been constructed and tested in order to optimized different functions in which the Computer Processing Unit (CPU) uses to carry out various operations. As is it used so often, it is important that the ALU function correctly, with high performance, and with low energy consumption. This paper reviews and analyses ten different ALU designs, focusing on m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015